Competitive Algorithms for Online Pricing
نویسندگان
چکیده
Given a seller with m amount of items, a sequence of users {u1, u2, ...} come one by one, the seller must set the unit price and assign some amount of items to each user on his/her arrival. Items can be sold fractionally. Each ui has his/her value function vi(·) such that vi(x) is the highest unit price ui is willing to pay for x items. The objective is to maximize the revenue by setting the price and amount of items for each user. In this paper, we have the following contributions: if the highest value h among all vi(x) is known in advance, we first show the lower bound of the competitive ratio is O(log h), then give an online algorithm with competitive ratio O(log h); if h is not known in advance, we give an online algorithm with competitive ratio O(h log −1/2 ).
منابع مشابه
Advertisement allocation for generalized second-pricing schemes
Recently, there has been a surge of interest in algorithms that allocate advertisement space in an online revenue-competitive manner. Most such algorithms, however, assume a pay-as-you-bid pricing scheme. In this paper, we study the query allocation problem where the ad space is priced using the well-known and widely-used generalized second price (GSP) scheme. We observe that the previous algor...
متن کاملBlindly-competitive Algorithms for Pricing & Bidding
The standard setting for competitive analysis of online algorithms assumes that on-line algorithm knows the past (but not future) inputs, and can optimize its performance by \learning" from mistakes of the past. This framework cannot capture some of the real-life online decision-making, which takes place without full knowledge of past and present inputs. Instead, online algorithm only knows a f...
متن کاملBlindly-competitive Algorithms: Pricing & Bidding as a Case Study
The standard setting for competitive analysis of online algorithms assumes that on-line algorithm knows the past (but not future) inputs, and can optimize its performance by \learning" from mistakes of the past. This framework cannot capture some of the real-life online decision-making, which takes place without full knowledge of past and present inputs. Instead, online algorithm only knows a f...
متن کاملOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملAn efficient Imperialistic Competitive Algorithm for the closed-loop supply chains considering pricing for product, and fleet of heterogeneous vehicles
This paper investigates a pricing multi-period, closed-loop supply chains (CLSCs) with two echelons of producers and customers. Products are delivered to customers might be defective which are picked up and gathered in the collection center and will be fixed if it is possible and will be returned to the chain. Otherwise, they are sold as waste. This problem is determining price and distributio...
متن کاملSelling Banner Ads: Online Algorithms with Buyback
We initiate the study of online pricing problems in markets with “buyback,” i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives requests online and chooses which requests to accept, subject to constraints on the subsets of requests which may be accepted simultaneously. A request, once accepted, can be canceled at a cost which is a fix...
متن کامل